Towards a mechanized metatheory of standard ML
نویسندگان
چکیده
منابع مشابه
Mechanizing the Metatheory of Standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twelf. The internal language is intended to serve as the target of elaboration in an elaborative semantics for Standard ML in the style of Harper and Stone. Therefore, it includes all the programming mechanisms necessary ...
متن کاملMechanized metatheory revisited
Proof assistants and the programming languages that implement them need to deal with a range of linguistic expressions that involve bindings. Since most mature proof assistants do not have built-in methods to treat this aspect of syntax, they have been extended with various packages and libraries that allow them to encode such syntax using, for example, de Bruijn numerals and nominal logic feat...
متن کاملMechanized metatheory revisited (abstract)
Over a decade ago, the POPLmark challenge [2] suggested that the theorem proving community had tools that were close to being usable by programming language researchers to formally prove properties of their designs and implementations. The authors of the POPLmark challenge looked at existing practices and systems and urged the developers of proof assistants to make improvements to existing syst...
متن کاملA Metatheory of a Mechanized Object Theory
(51) We apply 8I to (51) and prove (49). P and t are deened inductively over the structure of sequent trees. In the base case, we have P and t such that (47) is 8x (T(x) T(x)). Consider now the step case. We write (47) in the following form. (52) where P x 1 ; :::; x n ] does not contain occurrences of T. We assume the hypotheses of (52) and derive Tac(x 1) ^ ::: ^ Tac(x m). From (29) we obtain...
متن کاملαCheck: A mechanized metatheory model checker
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has received considerable attention recently. However, the dual problem of searching for errors in such formalizations has attracted comparatively little attention. In this article, we present αCheck, a bounded model-checke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2007
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1190215.1190245